package com.top75;

import com.bean.TreeNode;

import java.util.PriorityQueue;

/**
 * @Author: huangzhigao
 * @Date: 2023/5/22 20:37
 */
public class Code104 {
    public int maxDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
    }
}
